On possibilistic modal logics defined over MTL-chains

In this paper we revisit a 1994 paper by Hájek et al. where a modal logic over a finitely-valued Lukasiewicz logic is defined to capture possibilistic reasoning. In this paper we go further in two aspects: first, we generalize the approach in the sense of considering modal logics over an arbitrary finite MTL-chain, and second, we consider a different possibilistic semantics for the necessity and possibility modal operators. The main result is a completeness proof that exploits similar techniques to the ones involved in Hájek et al.?s previous work. URL http://link.springer.com/chapter/10.1007/978-3-319-06233-4_11 [8] Source URL: https://www.iiia.csic.es/en/node/54254 Links [1] https://www.iiia.csic.es/en/staff/f%C3%A9lix-bou [2] https://www.iiia.csic.es/en/staff/francesc-esteva [3] https://www.iiia.csic.es/en/staff/llu%C3%ADs-godo [4] https://www.iiia.csic.es/en/staff/franco-montagna [5] https://www.iiia.csic.es/en/bibliography?f[keyword]=458 [6] https://www.iiia.csic.es/en/bibliography?f[keyword]=459 [7] https://www.iiia.csic.es/en/bibliography?f[keyword]=457 [8] http://link.springer.com/chapter/10.1007/978-3-319-06233-4_11